Computational Geometry On The OTIS-Mesh Optoelectronic Computer
نویسندگان
چکیده
We develop efficient algorithms for problems in computational geometry—convex hull, smallest enclosing box, ECDF, two-set dominance, maximal points, all-nearest neighbor, and closest-pair—on the OTIS-Mesh optoelectronic computer. We also demonstrate the algorithms for computing convex hull and prefix sum with condition on a multi-dimensional mesh, which are used to compute convex hull and ECDF respectively. We show that all these problems can be solved in time even with inputs.
منابع مشابه
Basic Operations on the OTIS-Mesh Optoelectronic Computer
In this paper we develop algorithms for some basic operations { broadcast, window broad-access read and write { on the OTIS-Mesh 10] model. These operations are useful in the development of eecient algorithms for numerous applications 8].
متن کاملParallel Algorithm for Time Series Based Forecasting on OTIS-Mesh
Forecasting plays an important role in business, technology, climate and many others. As an example, effective forecasting can enable an organization to reduce lost sales, increase profits and more efficient production planning. In this paper, we present a parallel algorithm for short term forecasting based on a time series model called weighted moving average. Our algorithm is mapped on OTIS-m...
متن کاملBPC Permutations on the OTIS-Hypercube Optoelectronic Computer
We show that the diameter of an N 2 processor OTIS-Hypercube computer (N = 2 d) is 2d + 1. OTIS-Hypercube algorithms for some commonly performed permutations { transpose, bit reversal, vector reversal, perfect shuue, unshuue, shuued row-major, and bit shuue { are developed. We also propose an algorithm for general BPC permutations.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002